Correlation decay for hard spheres via Markov chains
نویسندگان
چکیده
We improve upon all known lower bounds on the critical fugacity and density of hard sphere model in dimensions three higher. As dimension tends to infinity, our improvements are by factors 2 1.7, respectively. make these utilizing techniques from theoretical computer science show that a certain Markov chain for sampling mixes rapidly at low enough fugacities. then prove an equivalence between optimal spatial temporal mixing spheres deduce results.
منابع مشابه
An Interruptible Algorithm for Perfect Sampling via Markov Chains Short Title: Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an enormously large state space, but elementary sampling is ruled out by the infeasibility of calculating an appropriate normalizing constant. The same difficulty arises in computer science problems where one seeks to sam...
متن کاملA New Mixing Rule for Mixtures of Hard Spheres
A mixing rule for the mixtures of hard-spheres is presented which can be reduced to the standard van der Waals mixing rule at low densities. The effectiveness of the mixing rule for the size and energy parameters of lennard-Jones fluid are examined by combining them with an equation of state to calculate thermodynamic properties. The results of calculation are compared with the molecular dy...
متن کاملComputing Densities for Markov Chains via Simulation
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...
متن کاملProbabilistic XML via Markov Chains
We show how Recursive Markov Chains (RMCs) and their restrictions can define probabilistic distributions over XML documents, and study tractability of querying over such models. We show that RMCs subsume several existing probabilistic XML models. In contrast to the latter, RMC models (i) capture probabilistic versions of XML schema languages such as DTDs, (ii) can be exponentially more succinct...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Applied Probability
سال: 2022
ISSN: ['1050-5164', '2168-8737']
DOI: https://doi.org/10.1214/21-aap1728